The Crossover Closure and Partial Match Detection
نویسندگان
چکیده
The crossover closure generation rule characterizes the generalization achieved by artificial immune systems using partial match detection. The paper reviews earlier results and extends the previously introduced notion of crossover closure to encompass additional match rules. For concreteness, the discussion focuses on r-chunks matching, giving alternative ways that detectors can be used to implement the crossover closure.
منابع مشابه
Driver Drowsiness Detection by Identification of Yawning and Eye Closure
Today most accidents are caused by drivers’ fatigue, drowsiness and losing attention on the road ahead. In this paper, a system is introduced, using RGB-D cameras to automatically identify drowsiness and give warning. In this system two important modules have been utilized simultaneously to identify the state of driver’s mouth and eyes for detecting drowsiness. At first, using the depth informa...
متن کامل?????? Partial Closure ????? ?? ????? ????? ? ??? ??? ?? ???????? ?? ????? ?????????
This article has no abstract.
متن کاملAnalysis and Diagnosis of Partial Discharge of Power Capacitors Using Extension Neural Network Algorithm and Synchronous Detection Based Chaos Theory
Power capacitors are important equipment of the power systems that are being operated in high voltage levels at high temperatures for long periods. As time goes on, their insulation fracture rate increases, and partial discharge is the most important cause of their fracture. Therefore, fast and accurate methods have great importance to accurately diagnosis the partial discharge. Conventional me...
متن کاملPartial Match Queries Using Error CorrectingCode
An important component of some data mining algorithms is determining the frequency of some set of attributes in an extremely large dataset. This requires partial match queries, in which some attributes have \don't care" values. We present a partial match query algorithm that uses the codewords of error-correcting codes as signatures.
متن کاملAn Efficient Transitive Closure Algorithm for Cyclic Digraphs
We present a new transitive closure algorithm that is based on strong component detection. The new algorithm is more eecient than the previous transitive closure algorithms that are based on strong components detection, since it does not generate unnecessary partial successor sets and scans the input graph only once.
متن کامل